Domino tilings of orthogonal polygons
نویسندگان
چکیده
We consider orthogonal polygons with vertices located at integer lattice points. We show that if all of the sides of a simple orthogonal polygon without holes have odd lengths, then it cannot be tiled by dominoes. We provide similar characterizations for orthogonal polygons with sides of arbitrary length. We also give some generalizations for polygons with holes and polytopes in 3 dimensions.
منابع مشابه
On the Computation and Chromatic Number of Colored Domino Tilings
A colored domino is a rotatable 2× 1 rectangle that is partitioned into two unit squares, which are called faces, each of which is assigned a color. In a colored domino tiling of an orthogonal polygon P , a set of dominoes completely covers P such that no dominoes overlap and so that adjacent faces have the same color. We provide tight bounds on the number of colors required to tile simple and ...
متن کاملOn Tilable Orthogonal Polygons∗
We consider rectangular tilings of orthogonal polygons with vertices located at integer lattice points. Let G be a set of reals closed under the usual addition operation. A G-rectangle is a rectangle at least one of whose sides is in G. We show that if an orthogonal polygon without holes can be tiled with G-rectangles then one of the sides of the polygon must be in G. As a special case this sol...
متن کاملOn the Tileability of Polygons with Colored Dominoes
We consider questions concerning the tileability of orthogonal polygons with colored dominoes. A colored domino is a rotatable 2× 1 rectangle that is partitioned into two unit squares, which are called faces, each of which is assigned a color. In a colored domino tiling of an orthogonal polygon P , a set of dominoes completely covers P such that no dominoes overlap and so that adjacent faces ha...
متن کاملDimers, tilings and trees
Generalizing results of Temperley [11], Brooks, Smith, Stone and Tutte [1] and others [10, 7] we describe a natural equivalence between three planar objects: weighted bipartite planar graphs; planar Markov chains; and tilings with convex polygons. This equivalence provides a measure-preserving bijection between dimer coverings of a weighted bipartite planar graph and spanning trees of the corre...
متن کاملA Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کامل